Перевод: со всех языков на русский

с русского на все языки

path computation

См. также в других словарях:

  • Path computation element — Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint based path computation is a strategic… …   Wikipedia

  • Computation tree logic — Computation tree logic (CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is… …   Wikipedia

  • Path tracing — is a photorealistic computer graphics rendering technique by James Kajiya when he presented his paper on the rendering equation in the 1980s. The main goal of path tracing is to fully solve the rendering equation. The image quality provided by… …   Wikipedia

  • Computation tree — A computation tree is a representation for the computation steps of a non deterministic Turing machine on a specified input. A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state,… …   Wikipedia

  • Computation of radiowave attenuation in the atmosphere — One of the causes of attenuation of radio propagation is the absorption by the atmosphere. There are many well known facts on the phenomenon and qualitative treatments in textbooks.[1] A document published by the International Telecommunication… …   Wikipedia

  • Continuous quantum computation — Two major motivations for studying continuous quantum computation are: Many scientific problems have continuous mathematical formulations. Examples of such formulations are Path integration Feynman Kac path integration Schrödinger equation In… …   Wikipedia

  • Induced path — An induced path of length four in a cube. Finding the longest induced path in a hypercube is known as the snake in the box problem. In the mathematical area of graph theory, an induced path in an undirected graph G is a path that is an induced… …   Wikipedia

  • Symbolic computation — Symbolic computation, algebraic computation, or, less commonly, symbolic manipulation, symbolic processing, symbolic mathematics, or symbolic algebra, relates to the use of machines, such as computers, to manipulate mathematical equations and… …   Wikipedia

  • Multicast Open Shortest Path First — MOSPF (Multicast open shortest path first) ist die Multicast Erweiterung zu OSPF (open shortest path first). MOSPF ermöglicht das Multicast Routing innerhalb einer OSPF Domain. Hierbei ist aber besonderes Augenmerk auf die Tatsache zu legen, dass …   Deutsch Wikipedia

  • Routing — This article is about routing in networks. For other uses, see Routing (disambiguation). Routing is the process of selecting paths in a network along which to send network traffic. Routing is performed for many kinds of networks, including the… …   Wikipedia

  • Adrian Farrel — is a co chair of three IETF working groups, namely CCAMP ,IETF s Working Group, [http://www.ietf.org/html.charters/ccamp charter.html Common Control and Measurement Plane (ccamp) ] ] PCE IETF s Working Group,… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»